Axiomatization of Induced Theories

نویسندگان

  • AZRIEL levy
  • AZRIEL LEVY
چکیده

This note gives a method of presenting axiom systems for various induced theories like the natural numbers theory of the real numbers theory and the pure set theory (with no constants except G and = and with set variables only) induced by the Zermelo-Fraenkel set theory with the axion of foundation, an operation symbol cr(x), an axiom x^0Z) by their definitions in Q. We assume, in the definition of a relative interpretation, that1 Q\-f((3x)(x = x)). Q/R—the theory induced by Q on R (by means of /)—is defined as follows: is a theorem of Q/R if f(<p) is a theorem of Q. We assume the metalanguage of Q to be arithmetized.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simple axiomatization of reticulations on residuated lattices

‎We give a simple and independent axiomatization of reticulations on residuated lattices‎, ‎which were axiomatized by five conditions in [C‎. ‎Mureşan‎, ‎The reticulation of a residuated lattice‎, ‎Bull‎. ‎Math‎. ‎Soc‎. ‎Sci‎. ‎Math‎. ‎Roumanie‎ ‎51 (2008)‎, ‎no‎. ‎1‎, ‎47--65]‎. ‎Moreover‎, ‎we show that reticulations can be considered as lattice homomorphisms between residuated lattices and b...

متن کامل

Probabilistic I/O Automata: Theories of Two Equivalences

Working in the context of a process-algebraic language for Probabilistic I/O Automata (PIOA), we study the notion of PIOA behavior equivalence by obtaining a complete axiomatization of its equational theory and comparing the results with a complete axiomatization of a more standard equivalence, weighted bisimulation. The axiomatization of behavior equivalence is achieved by adding to the langua...

متن کامل

Complete First-Order Axiomatization of Finite or Infinite M-extended Trees

We present in this paper an axiomatization of the structure of finite or infinite M -extended trees. This structure is an intuitive combination of the structure of finite or infinite trees with another structure M and expresses semantically an extension to trees of the model M . Having a structure M = (DM , FM , RM ), we define the structure of finite or infinite M -extended tree ExtM = (D, F, ...

متن کامل

Characterization and axiomatization of all semigroups whose square is group

In this paper we give a characterization for all semigroups whose square is a group. Moreover, we axiomatize such semigroups and study some relations between the class of these semigroups and Grouplikes,introduced by the author. Also, we observe that this paper characterizes and axiomatizes a class of Homogroups (semigroups containing an ideal subgroup).  Finally, several equivalent conditions ...

متن کامل

Some Remarks on Conway and Iteration Theories

We present an axiomatization of Conway theories which yields, as a corollary, a very concise axiomatization of iteration theories satisfying the functorial implication for base morphisms. It has been shown that most fixed point operations in computer science share the same equational properties. These equational properties are captured by the notion of iteration theories [1, 3]. Several axiomat...

متن کامل

A simpler axiomatization of the Shelah-Spencer almost sure theories

We give an explicit AE-axiomatization of the almost sure theories of sparse random graphs G(n, n−α) of Shelah-Spencer. In the process we give a method of constructing extensions of graphs whose ‘relative dimension’ is negative, but arbitrarily small. We describe the existentially closed and locally finite models of the theory and produce types of dimension zero. We offer a useful characterizati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010